Angular Momentum, Convex Polyhedra and Algebraic Geometry

نویسنده

  • M. F. ATIYAH
چکیده

The three families of classical groups of linear transformations (complex, orthogonal, symplectic) give rise to the three great branches of differential geometry (complex analytic, Riemannian and symplectic). Complex analytic geometry derives most of its interest from complex algebraic geometry, while symplectic geometry provides the general framework for Hamiltonian mechanics. These three classical groups "intersect" in the unitary group and the three branches of differential geometry correspondingly "intersect" in Kahler geometry, which includes the study of algebraic varieties in projective space. This is the basic reason why Hodge was successful in applying Riemannian methods to algebraic geometry in his theory of harmonic forms. In the past few years it has been realised that some of the ideas from symplectic geometry can also be applied to algebraic geometry. The key notion is that of angular momentum and the main technical result is a convexity theorem [1] [6] which asserts that the simultaneous values of commuting angular momenta form a convex polyhedron. My aim in this talk is to illustrate some of these new ideas and I will begin in the next two Sections by describing two results connecting algebra with convex polyhedra. These appear quite unrelated and neither is in a geometric form. Nevertheless I will show in subsequent sections how they both fit elegantly into the symplectic framework, which is explained in Section 4. In Section 7 I will discuss briefly the very important application to geometric invariant theory. Finally in Section 8 I will explain the "exact integration formulae" of Duistermaat and Heckman [5]. This is of interest not so much in algebraic geometry but as a prototype of infinite-dimensional counterparts which arise as models in theoretical physics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees

We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound ~2 (log N) (resp. f2 (log N/log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > ( n d ) ~( ' ) (resp. N > nU<n)). This bound apparently does not follow from the methods...

متن کامل

Research Summary

In my doctoral dissertation (directed by W. P. Thurston) I studied the geometry of convex polyhedra in hyperbolic 3-space H3, and succeeded in producing a geometric characterization of dihedral angles of compact convex polyhedra by reducing the question to a convex isometric embedding problem in the De Sitter sphere, and resolving this problem. In particular, this produced a simple alternative ...

متن کامل

When can a graph form an orthogonal polyhedron?

Polyhedra are an important basic structure in computational geometry. One of the most beautiful results concerning polyhedra is Cauchy’s theorem, which states that a convex polyhedron is uniquely defined by its graph, edge lengths and facial angles. (See Section 2 for definitions.) The proof of Cauchy’s theorem (see e.g. [2]) unfortunately is nonconstructive, and the only known algorithm to rec...

متن کامل

A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions

Chazelle [FOCS’89] gave a linear-time algorithm to compute the intersection of two convex polyhedra in three dimensions. We present a simpler algorithm to do the same. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems

متن کامل

Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications

We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1983